Bandwidth-allocation policies for unicast and multicast flows
نویسندگان
چکیده
منابع مشابه
Core Stateless Fair Bandwidth Allocation for Unicast and Multicast Flows
In this paper we aim at developing a solution to fairly allocating bandwidth among unicast and multicast flows. For this purpose, we propose the anycast max-min fairness criterion, which is based on the well known max-min fairness criterion for unicast. We then present an efficient implementation of the proposed criterion: the Multicast Fair Bandwidth Allocation (MFBA) architecture. The MFBA ar...
متن کاملSBQ: A Simple Scheduler for Fair Bandwidth Sharing Between Unicast and Multicast Flows
In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We utilize our recently proposed active queue management mechanism MFQ (Multicast Fair Queuing) to fairly share the bandwidth among all competing flows in the multicast ...
متن کاملFair bandwidth sharing between unicast and multicast flows in best-effort networks
In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We also describe a new active queue management mechanism called MFQ (Multicast Fair Queuing) to fairly share the allowed multicast bandwidth among competing flows in the...
متن کاملDynamic Bandwidth Allocation Policies
When traac of connectionless best eeort protocols such as IP is carried over connection oriented protocols with guaranteed bandwidth, such as CBR connection in ATM, the interface layer between the protocols (i.e., AAL-the ATM Adaption Layer) need to specify the bandwidth requirement and the duration of the bandwidth reservation. The purpose of this paper is to develop policies for deciding and ...
متن کاملWeighted Fair Bandwidth Allocation for Adaptive Flows
Abstract— In this paper, we propose a gateway algorithm supporting both weighted fairness and queue management. Though some algorithms are proposed for fairness with queue management in the literature, they do not concern about the flow weight. Our proposed algorithm classifies an incoming packet into a flow and drops it stochastically according to the queue length and the fair bandwidth share ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2001
ISSN: 1063-6692
DOI: 10.1109/90.944344